Decomposing demographic change into direct vs. compositional components

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decomposing a Multigraph into Split Components

A linear-time algorithm for decomposing a graph into split components is presented. The algorithm uses a new graph transformation technique to gradually transform the given graph so that every split component in it is transformed into a subgraph with very simple structure which can be easily identified. Once the split components are determined, the triconnected components of the graph are easil...

متن کامل

Decomposing Polygons Into Diameter Bounded Components

A decomposition of a polygon P is a set of polygons whose geometric union is exactly P . We consider the problem of decomposing a polygon, which may contain holes, using subpolygons that have a bounded diameter. We show that this problem is NP-complete via a reduction from Planar 3, 4SAT .

متن کامل

On decomposing speech into modulated components

We model a segment of filtered speech signal as a product of elementary signals as opposed to a sum of sinusoidal signals. Using this model, one can better appreciate the basic relationships between envelopes and phases or instantaneous frequencies (IF’s) of signals. These relationships reveal some interesting properties of the signal’s modulations. For instance, if the contribution due to a si...

متن کامل

Decomposing Boolean formulas into connected components

The aim of this contribution is to find a way how to improve efficiency of current state-of-the-art satisfiability solvers. The idea is to split a given instance of the problem into parts (connected components) which can be solved separately. For this purpose we define component trees and a related problem of finding optimal component trees. We describe how this approach can be combined with st...

متن کامل

Decomposing SAT Problems into Connected Components

Many SAT instances can be decomposed into connected components either initially after preprocessing or during the solution phase when new unit conflict clauses are learned. This observation allows components to be solved individually. We present a technique to handle components within a GRASP like SAT solver without requiring much change to the solver. Results obtained when applying our impleme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Demographic Research

سال: 2002

ISSN: 1435-9871

DOI: 10.4054/demres.2002.7.1